Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Leaves - Nicky C. #28

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Leaves - Nicky C. #28

wants to merge 1 commit into from

Conversation

njch5
Copy link

@njch5 njch5 commented Dec 9, 2019

Linked List Comprehension Questions

Question Response
1. What advantages does a LinkedList have over an Array? LinkedLists are advantageous when adding or removing an element due to memory being dynamically allocated. Elements do not need to be contiguously stored like in arrays.
2. When is an Array more advantageous? When we want to find an element at a particular index. In LinkedLists, we would have to traverse through the entire list as we are unable to jump to a specific element.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Well done, you hit the learning goals here. You do have one bug in the final method of the assignment. Otherwise nice work!

# Time complexity - ?
# Space complexity - ?
# Time complexity - O(1)
# Space complexity - O(1)
def add_first(data)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

# Time complexity - ?
# Space complexity - ?
# Time complexity - O(n) where n is the index
# Space complexity - O(1)
def get_at_index(index)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

What if index is greater than the length of the list?

def get_last
return nil unless @head

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

🥇

# Time complexity - ?
# Space complexity - ?
# Time complexity - O(n) where n is the length of the list
# Space complexity - O(1)
def get_last

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

# Time complexity - ?
# Space complexity - ?
# Time complexity - O(n) n is the length of the list
# Space complexity - O(1)
def add_last(data)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

# Time complexity - ?
# Space complexity - ?
# Time complexity - O(n) n is the size of the list
# Space complexity - O(1)
def length

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

def get_first
return @head if @head.nil?

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

more readable to have

Suggested change
return @head if @head.nil?
return nil if @head.nil?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants